First-Order Interpretations of Bounded Expansion Classes
نویسندگان
چکیده
منابع مشابه
First-order queries on classes of structures with bounded expansion
We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor. It was known that over a class of databases with bounded expansion, firstorder sentences could be evaluated in time linear in the size of the database. We give a ...
متن کاملSmall graph classes and bounded expansion
A class of simple undirected graphs is small if it contains at most n!α labelled graphs with n vertices, for some constant α. We prove that for any constants c, ε > 0, the class of graphs with expansion bounded by the function f(r) = c 1/3−ε is small. Also, we show that the class of graphs with expansion bounded by 6 · 3 √ r log(r+e) is not small. We work with simple undirected graphs, without ...
متن کاملDistributed Domination on Graph Classes of Bounded Expansion
We provide a new constant factor approximation algorithm for the (connected) distance-r dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as planar graphs and graphs with excluded (topological) minors, and notably, these classes form the most general subgraph closed classes of graphs for which a sequent...
متن کاملLocally identifying coloring in bounded expansion classes of graphs
A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors used by a locally identifying vertex-coloring. In this paper, we prove that for any graph class of bounded expansion, the lid-chromatic number is bounded. Cla...
متن کاملCharacterisations and examples of graph classes with bounded expansion
Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Nešetřil and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a shallow minor of a graph in the class is bounded by a function of the depth of the shallow minor. Several linear-time algorithms are known for bounded expansion classe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2020
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3382093